On Downward Closure Ordinals of Logic Programs
نویسندگان
چکیده
منابع مشابه
Analysis of Downward Closed Properties of Logic Programs
We study the analysis of downward closed properties of logic programs, which are a very abstract presentation of types. We generalise to a very large class of downward closed properties the construction of the traditional domains for groundness analysis in such a way that the results enjoy the good properties of that domain. Namely, we obtain abstract domains with a clear representation made of...
متن کاملSystems of Logic Based on Ordinals
These documents can only be used for educational and research purposes (“Fair use”) as per U.S. Copyright law (text below). By accessing this file, all users agree that their use falls within fair use as defined by the copyright law. They further agree to request permission of the Princeton University Library (and pay any fees, if applicable) if they plan to publish, broadcast, or otherwise dis...
متن کاملSystems of logic based on ordinals
Stable configurations and Lamport clocks have garnered improbable interest from both cyberneticists and researchers in the last several years. In our research, we disconfirm the synthesis of thin clients, which embodies the important principles of networking. We construct new mobile theory (TRITYL), which we use to verify that compilers and operating systems are mostly incompatible.
متن کاملOrdinals and interactive programs
The work reported in this thesis arises from the old idea, going back to the origins of constructive logic, that a proof is fundamentally a kind of program. If proofs can be considered as programs, then one might expect that proof theory should have much to contribute to the theory of programming. This has indeed turned out to be the case. Various technologies developed in proof theory are now ...
متن کاملOn closure ordinals for the modal μ-calculus
The closure ordinal of a formula of modal μ-calculus μXφ is the least ordinal κ, if it exists, such that the denotation of the formula and the κ-th iteration of the monotone operator induced by φ coincide across all transition systems (finite and infinite). It is known that for every α < ω2 there is a formula φ of modal logic such that μXφ has closure ordinal α [3]. We prove that the closure or...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Informaticae
سال: 1990
ISSN: 1875-8681,0169-2968
DOI: 10.3233/fi-1990-13107